A Mayer-Vietoris Formula for Persistent Homology with an Application to Shape Recognition in the Presence of Occlusions

نویسندگان

  • Barbara Di Fabio
  • Claudia Landi
چکیده

In algebraic topology it is well-known that, using the Mayer-Vietoris sequence, the homology of a space X can be studied splitting X into subspaces A and B and computing the homology of A, B, A∩B. A natural question is to which an extent persistent homology benefits of a similar property. In this paper we show that persistent homology has a Mayer-Vietoris sequence that in general is not exact but only of order two. However, we obtain a Mayer-Vietoris formula involving the ranks of the persistent homology groups of X , A, B and A∩B plus three extra terms. This implies that topological features of A and B either survive as topological features of X or are hidden in A∩B. As an application of this result, we show that persistence diagrams are able to recognize an occluded shape by showing a common subset of points.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Persistent homology and partial matching of shapes

The ability to perform not only global matching but also partial matching is investigated in computer vision and computer graphics in order to evaluate the performance of shape descriptors. In my talk I will consider the persistent homology shape descriptor, and I will illustrate some results about persistence diagrams of occluded shapes and partial shapes. The main tool is a Mayer-Vietoris for...

متن کامل

Size functions for shape recognition in the presence of occlusions

In Computer Vision the ability to recognize objects in the presence of occlusions is a necessary requirement for any shape representation method. In this paper we investigate how the size function of an object shape changes when a portion of the object is occluded by another object. More precisely, considering a set X = A∪B and a measuring function φ on X , we establish a condition so that `(X ...

متن کامل

A spectral sequence for parallelized persistence

We approach the problem of the computation of persistent homology for large datasets by a divide-and-conquer strategy. Dividing the total space into separate but overlapping components, we are able to limit the total memory residency for any part of the computation, while not degrading the overall complexity much. Locally computed persistence information is then merged from the components and t...

متن کامل

The Topological "Shape" of Brexit

Persistent homology is a method from computational algebraic topology that can be used to study the “shape” of data. We illustrate two filtrations — the weight rank clique filtration and the Vietoris–Rips (VR) filtration — that are commonly used in persistent homology, and we apply these filtrations to a pair of data sets that are both related to the 2016 European Union “Brexit” referendum in t...

متن کامل

Math 215b Notes: Algebraic Topology

1. Simplices, ∆-Complexes, and Homology: 1/8/15 1 2. Properties of Singular Homology: 1/13/15 4 3. Homotopy Invariance of Singular Homology: 1/15/15 7 4. Applications of Homotopy Invariance and Excision: 1/20/15 10 5. Equivalence of Singular and Simplicial Homology: 1/22/15 14 6. Degrees of Maps on Sn: 1/27/15 17 7. The Mayer-Vietoris Sequence and Applications: 1/29/15 20 8. CW Complexes: 2/3/1...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Foundations of Computational Mathematics

دوره 11  شماره 

صفحات  -

تاریخ انتشار 2011